Exponential inequalities for nonstationary Markov chains
نویسندگان
چکیده
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملCheeger inequalities for transient Markov chains
We construct upper and lower bounds for Cheeger-type constants for transient Markov chains. We first treat the situation where there is a detailed balance condition and obtain bounds that rely exclusively on the first and second eigenvalues of the substochastic transition matrix. Secondly, we consider general substochastic transition matrices and develop bounds in this broader setting. The effi...
متن کاملNash Inequalities for Finite Markov Chains
This paper develops bounds on the rate of decay of powers of Markov kernels on finite state spaces. These are combined with eigenvalue estimates to give good bounds on the rate of convergence to stationarity for finite Markov chains whose underlying graph has moderate volume growth. Roughly, for such chains, order (diameter) 2 steps are necessary and suffice to reach stationarity. We consider l...
متن کاملComparison Inequalities and Fastest-mixing Markov Chains
We introduce a new partial order on the class of stochastically monotone Markov kernels having a given stationary distribution π on a given finite partially ordered state space X . When K L in this partial order we say that K and L satisfy a comparison inequality. We establish that if K1, . . . ,Kt and L1, . . . , Lt are reversible and Ks Ls for s = 1, . . . , t, then K1 · · ·Kt L1 · · ·Lt. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dependence Modeling
سال: 2019
ISSN: 2300-2298
DOI: 10.1515/demo-2019-0007